Sets of parts such that the partition function is even
نویسندگان
چکیده
منابع مشابه
Sets with even partition functions and 2-adic integers
For P ∈ F2[z] with P (0) = 1 and deg(P ) ≥ 1, let A = A(P ) be the unique subset of N such that ∑ n≥0 p(A, n)zn ≡ P (z) (mod 2), where p(A, n) is the number of partitions of n with parts in A. Let p be an odd prime number, and let P be irreducible of order p ; i.e., p is the smallest positive integer such that P divides 1+ zp in F2[z]. N. Baccar proved that the elements of A(P ) of the form 2km...
متن کاملA Combinatorial Proof of Andrews' Smallest Parts Partition Function
We give a combinatorial proof of Andrews' smallest parts partition function with the aid of rooted partitions introduced by Chen and the author.
متن کاملA formula for the partition function that “counts”
We derive a combinatorial multisum expression for the number D(n, k) of partitions of n with Durfee square of order k. An immediate corollary is therefore a combinatorial formula for p(n), the number of partitions of n. We then study D(n, k) as a quasipolynomial. We consider the natural polynomial approximation D̃(n, k) to the quasipolynomial representation of D(n, k). Numerically, the sum ∑ 1≤k...
متن کاملComputable real function F such that F is not polynomial time computable on [0, 1]
A computable real function F on [0,1] is constructed such that there exists an exponential time algorithm for the evaluation of the function on [0,1] on Turing machine but there does not exist any polynomial time algorithm for the evaluation of the function on [0,1] on Turing machine (moreover, it holds for any rational point on (0,1))
متن کاملPartition-free families of sets
Let m(n) denote the maximum size of a family of subsets which does not contain two disjoint sets along with their union. In 1968 Kleitman proved that m(n) = ( n m+1 ) + . . . + ( n 2m+1 ) if n = 3m + 1. Confirming the conjecture of Kleitman, we establish the same equality for the cases n = 3m and n = 3m + 2, and also determine all extremal families. Unlike the case n = 3m + 1, the extremal fami...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 2003
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa106-2-8